Created Objects, Coherence, and Anaphora

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Effect of Establishing Coherence in Ellipsis and Anaphora Resolution

This paper presents a new model of anaphoric processing that utilizes the establishment of coherence relations between clauses in a discourse. We survey data that comprises a currently stalemated argument over whether VP-ellipsis is an inherently syntactic or inherently semantic phenomenon, and show that the data can be handled within a uniform discourse processing architecture. This architectu...

متن کامل

Modeling the Trust Boundaries Created by Securable Objects

Matt Miller presented his work on automatically discovering data flows between trust boundaries in the Microsoft Windows operating systems. Trust boundaries are divisions between privilege levels on a system (e.g., different user accounts or user versus administrator privileges). Discovering paths of data flow between privilege levels allows software auditors to audit only those sections of cod...

متن کامل

Unsupervised discovery of objects using temporal coherence

We present a novel unsupervised method for discovering objects in image sequences. Instead of using spatial homogeneity to partition pixels into regions, we group pixels into large temporally coherent clusters (TCCs) having a unique temporal signature. Each cluster’s temporal signature is explained by hypothesizing the arrival and departure of a small set of objects. Explanations of less ambigu...

متن کامل

Learning to Categorize Objects Using Temporal Coherence

The invariance of an objects' identity as it transformed over time provides a powerful cue for perceptual learning. We present an unsupervised learning procedure which maximizes the mutual information between the representations adopted by a feed-forward network at consecutive time steps. We demonstrate that the network can learn, entirely unsupervised, to classify an ensemble of several patter...

متن کامل

A Computational Approach to Pronominal Anaphora, One- Anaphora and Surface Count Anaphora

This paper is the continuation of Ferrández [5][4] in which we have developed a computational system in Prolog (Slot Unification Parser or SUP) that includes a new grammatical formalism (Slot Unification Grammar or SUG). In this work, we are going to deal with several kinds of anaphora both in restricted and unrestricted texts: pronominal anaphora, surface count anaphora and one-anaphora. We on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Semantics

سال: 2006

ISSN: 0167-5133,1477-4593

DOI: 10.1093/jos/ffl012